A predicate transformer for the progressproperty ` to - always ' Rutger
نویسندگان
چکیده
The temporal property`to-always' has been proposed for specifying progress properties of concurrent programs. Although thèto-always' properties are a subset of thèleads-to' properties for a given program, `to-always' has more convenient proof rules and in some cases more accurately describes the desired system behavior. In this paper, we give a predicate transformer wta, derive some of its properties, and use it to deenèto-always'. Proof rules for`to-always' are derived from the properties of wta. We conclude by brieey describing two application areas, nondeterministic data ow networks and self-stabilizing systems wherèto-always' properties are useful.
منابع مشابه
Dijkstra and Beverly A . Sanders , 1996 A predicate transformer for the progressproperty ` to - always
The temporal property`to-always' has been proposed for specifying progress properties of concurrent programs. Although thèto-always' properties are a subset of thèleads-to' properties for a given program, `to-always' has more convenient proof rules and in some cases more accurately describes the desired system behavior. In this paper, we give a predicate transformer wta, derive some of its prop...
متن کاملA duality between LM-fuzzy possibility computations and their logical semantics
Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...
متن کاملAction Systems with Continuous Behaviour
An action system framework is a predicate transformer based method for modelling and analysing distributed and reactive systems. The actions are statements in Dijkstra's guarded command language, and their semantics is given by predicate transformers. We extend conventional action systems with a di erential action consisting of a di erential equation and an evolution guard. The semantics is giv...
متن کاملFrame Based Typing of Predicate Transformers
The algebraic relationship between predicates and predicate transformers is considered. A canonical decomposition property of transformers is used to develop a typing mechanism for predicate transformer process models based on the input and output interfaces of the processes. Predicate transformers are typed according to the variables read from or written to by the process described by the pred...
متن کاملRelating State Transformation Semantics and Predicate Transformer Semantics for Parallel Programs
A state transformation semantics and a predicate transformer semantics for programs built from atomic actions, sequential composition, nondeterministic choice, parallel composition, atomisation, and recursion are presented. Both semantic models are derived from some SOS-style labelled transition system. The state transformation semantics and the predicate transformer semantics are shown to be i...
متن کامل